Solving Deductive Planning Problems Using Program Analysis and Transformation
نویسندگان
چکیده
Two general, problematic aspects of deductive planning, namely, detecting unsolvable planning problems and solving a certain kind of postdiction problem, are investigated. The work is based on a resource oriented approach to reasoning about actions and change using a logic programming paradigm. We show that ordinary resolution methods are insufficient for solving these problems and propose program analysis and transformation as a more promising and successful way to solve them.
منابع مشابه
Solving Deductive Planning Problems
Two general, problematic aspects of deductive planning, namely, detecting unsolvable planning problems and solving a certain kind of postdiction problem, are investigated. The work is based on a resource oriented approach to reasoning about actions and change using a logic programming paradigm. We show that ordinary resolution methods are insuucient for solving these problems and propose progra...
متن کاملSolving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning
We describe a framework that combines deductive, numeric, and inductive reasoning to solve geometric problems. Applications include the generation of geometric models and animations, as well as problem solving in the context of intelligent tutoring systems. Our novel methodology uses (i) deductive reasoning to generate a partial program from logical constraints, (ii) numerical methods to evalua...
متن کاملHandling Negation in General Deductive Databases: A Program Transformation Method
In this paper, we present a program transformation approach to compute the stable models of general deductive databases. Stable models have important applications in knowledge representation, database integration and repairs as well as in efficiently solving NP-complete problems. The method introduced in the paper first transforms the given deductive database with arbitrary negation into a “sem...
متن کاملSolving Demand Versions of Interprocedural Analysis Problems
This paper concerns the solution of demand versions of interprocedural analysis problems. In a demand version of a program-analysis problem, some piece of summary information (e.g., the dataflow facts holding at a given point) is to be reported only for a single program element of interest (or a small number of elements of interest). Because the summary information at one program point typicall...
متن کاملSolving Constrained Nonlinear Optimization Problems Through Constraint Partitioning
In this paper, we study efficient temporal planning based on a continuous and differentiable nonlinear programming transformation of the planning problem. Based on the observation that many large planning problems have constraint locality, we have previously proposed the constraint partitioning approach that utilizes the constraint structure by partitioning the constraints of a planning problem...
متن کامل